An Improved Ant Colony Routing Algorithm for WSNs
نویسندگان
چکیده
منابع مشابه
Ant Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملMobile Agent Routing Algorithm Based on Improved Ant Colony Algorithm
At the present stage wireless sensor network exists some deficiencies such as finite energy, limited communication capability, multi-hop routing and dynamic topology. In addition too many nodes which are distributed intensively influence also performance of wireless sensor network. Besides distributed optimization problem always impact to efficiency of the network. For data processing and routi...
متن کاملPBANT-Optimized ANT Colony Routing Algorithm For ManetsPBANT-Optimized ANT Colony Routing Algorithm For Manets
The biggest challenge in MANETs is to find a path between the communication end points, which is aggravated through the node mobility in a limited resource scenario.AntColony-Based Routing Algorithm (ARA) is an on-demand routing algorithm for mobile, multi-hop ad-hoc networks that uses swarm intelligence paradigm and ant colony based meta heuristic. These approaches try to map the solution capa...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Sensors
سال: 2015
ISSN: 1687-725X,1687-7268
DOI: 10.1155/2015/438290